Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc Networks

Opportunistic ad hoc networks are characterized by intermittent and infrastructure-less connectivity among mobile nodes. Because of the lack up-to-date network topology information frequent link failures, geographic routing utilizes location adopts store–carry–forward data delivery model to relay messages in a delay-tolerant manner. This paper proposes message-forwarding policy based on movement patterns (MPMF). First, one- two-hop neighborhood is exploited select nodes moving closer destination node. Message-forwarding decisions made referring selected nodes’ weight values obtained calculating contact frequency each node with Second, when relays vicinity message-carrying not qualified due sparse density nodal motion status, destination’s one-hop jointly utilized improve decision. If or away from it, its centrality value used instead. Based both synthetic real mobility scenarios, simulation results show that proposed performs incomparable efforts some typical policies, such as Epidemic, PRoPHETv2, temporal closeness centrality-based (TCCB), transient community-based (TC), geographic-based spray-and-relay (GSaR) policies.